Efficient Computation of Deterministic Extensions for Dynamic Abstract Argumentation Frameworks

ARGUMENTATION An (abstract) argumentation framework [1] (AF) is a pair 〈A,Σ〉, where A is a set of arguments and Σ ⊆ A×A is a set of attacks. – It allows representing dialogues, making decisions, and handling inconsistency; – An AF can be viewed as a direct graph, whose nodes are arguments and whose edges are attacks. SEMANTICS FOR AFS An argumentation semantics specifies the criteria for identifying a set of arguments considered to be “reasonable” together, called extension. A complete extension (co) is an admissible set that contains all the arguments that it defends. A complete extension S is said to be: – preferred iff it is maximal (w.r.t. ⊆); – grounded iff it is minimal; – ideal iff it is contained in every preferred extension and it is maximal. Grounded and ideal semantics are called deterministic or unique status as their sets of extensions are singletons.